AGATOR (Automatic Garbage Collector) as Automatic Garbage Collector Robot Model
نویسندگان
چکیده
منابع مشابه
Complementary Garbage Collector
This paper describes the design and the evaluation of Complementary Garbage Collector that is a fundamental algorithm for the parallel and incremental garbage collector. Our algorithm is a combination of two types of fundamental algorithms, incremental update and snapshot-at-beginning, which are complementary to each other. The algorithm has the advantages of both types: great e ciency of the g...
متن کاملReplicating real-time garbage collector
Real-time Java is becoming a viable platform for real-time applications, bringing new challenges to a garbage collector. A real-time collector has to be incremental as not to cause deadline misses by suspending an application for too long. In particular, if a real-time collector has to relocate objects in the heap, it must do so incrementally and transparently to the application. This is usuall...
متن کاملTMOS: A Transactional Garbage Collector
Defining persistence in terms of reachability is fundamental to achieving orthogonality of persistence. It is implicit to the principles of orthogonal persistence and is a part of the ODMG 3.0 data objects standard. Although space reclamation in the context of persistence by reachability can be achieved automatically using garbage collection, relatively few papers address the problem of impleme...
متن کاملJava Garbage Collector Performance Measurements
Advances in compiler and virtual machine technologies support spread of programming environments with automated memory management, such as Java. These environments rely on garbage collection to reclaim memory that is no longer used. While in the domain of garbage collection research, every proposed garbage collector improvement is accompanied with detailed analysis of the collector overhead [De...
متن کاملA Non-Fragmenting Non-Moving, Garbage Collector
1. ABSTRACT One of the biggest disadvantages of nonmoving collectors compared to moving collectors has been their limited ability to deal with memory fragmentation. In this paper, we describe two techniques to reduce fragmentation without the need for moving live data. The first technique reduces internal fragmentation in BiBoP (Big-Bag-of-Pages) like allocators. The second technique reduces ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Future Computer and Communication
سال: 2014
ISSN: 2010-3751
DOI: 10.7763/ijfcc.2014.v3.329